Optimality for Multi-Objective Programming Involving Arcwise Connected d-Type-I Functions
نویسندگان
چکیده
منابع مشابه
Optimality for Multi-Objective Programming Involving Arcwise Connected d-Type-I Functions
This paper deals with the optimality conditions and dual theory of multi-objective programming problems involving generalized convexity. New classes of generalized type-I functions are introduced for arcwise connected functions, and examples are given to show the existence of these functions. By utilizing the new concepts, several sufficient optimality conditions and Mond-Weir type duality resu...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملMultiple objective fractional programming involving semilocally type I-preinvex and related functions
Sufficient optimality conditions are obtained for a nonlinear multiple objective fractional programming problem involving η-semidifferentiable type I-preinvex and related functions. Furthermore, a general dual is formulated and duality results are proved under the assumptions of generalized semilocally type I-preinvex and related functions. Our result generalize the results of Preda [V. Preda, ...
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملMinimax Fractional Programming Involving Type I and Related Functions
⎯The convexity assumptions for a minimax fractional programming problem of variational type are relaxed to those of a type I and related functions. Sufficient optimality conditions are established under the aforesaid assumptions. Several duality theorems are obtained for Wolfe type and Mond-Weir type duals and the original problem. Keyword⎯Minimax programming; Fractional programming; Sufficient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2011
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2011.14028